Traversing Directed Eulerian Mazes
نویسندگان
چکیده
The paper describes two algorithms for threading unknown, finite directed Eulerian mazes. Each of these algorithms is performed by a traveling robot whose control is a finite-state automaton. It is assumed that each vertex has a circular list of its outgoing edges. The items of this list are called exits. Each of the algorithms puts in one of the exits of each vertex a scan pebble. These pebbles can be used by a simple robot as traffic signals, which allow it to traverse an Eulerian cycle of the maze. For a directed graph (maze) G(V, E), the simple algorithm performs O(|V | · |E|) edge traversals, while the advanced algorithm traverses every edge three times. Let dout(v) be the out-degree of vertex v. The algorithms use, at each vertex v, a local memory of size O(log dout(v)). Communicated by S. Khuller: submitted January 2002; revised June 2002 Work by S. Even supported by the Fund for the Promotion of Research at the Technion. S. Bhatt et al., Traversing Eulerian Mazes, JGAA, 6(2) 157–173 (2002) 158
منابع مشابه
Complex-Balanced Steady States of Chemical Reaction Networks that Contain an Eulerian Cycle
This work pertains to chemical reaction networks and their equilibria, called steady-states. Our main result states that for a cyclic chemical reaction network, there is a straightforward characterization for when a complex balancing steady state exists. We then extend our results to chemical reaction networks consisting of a closed path traversing each directed edge exactly once.
متن کاملEulerian digraphs and Dyck words, a bijection
The main goal of this work is to establish a bijection between Dyck words and a family of Eulerian digraphs. We do so by providing two algorithms implementing such bijection in both directions. The connection between Dyck words and Eulerian digraphs exploits a novel combinatorial structure: a binary matrix, we call Dyck matrix, representing the cycles of an Eulerian digraph. 1. Background, and ...
متن کاملLong Circuits and Large Euler Subgraphs
An undirected graph is Eulerian if it is connected and all its vertices are of even degree. Similarly, a directed graph is Eulerian, if for each vertex its in-degree is equal to its out-degree. It is well known that Eulerian graphs can be recognized in polynomial time while the problems of finding a maximum Eulerian subgraph or a maximum induced Eulerian subgraph are NP-hard. In this paper, we ...
متن کاملMinimal Eulerian trail in a labeled digraph
Let G be an Eulerian directed graph with an arc-labeling such that arcs going out from the same vertex have di erent labels. In this work, we present an algorithm to construct the Eulerian trail starting at an arbitrary vertex v of minimum lexicographical label among labels of all Eulerian trails starting at this vertex. We also show an application of this algorithm to construct the minimal de ...
متن کاملOn a Simple Depth-First Search Strategy for Exploring Unknown Graphs
We present a simple depth-rst search strategy for exploring (constructing) an unknown strongly connected graph G with m edges and n vertices by traversing at most min(mn; dn 2 + m) edges. Here, d is the minimum number of edges needed to add to G to make it Eulerian. This parameter d is known as the deeciency of a graph and was introduced by Kutten Kut88]. It was conjectured that graphs with low...
متن کامل